Finitely generated congruence distributive quasivarieties of algebras
نویسندگان
چکیده
منابع مشابه
Admissibility in Finitely Generated Quasivarieties
Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore decidable. However, since free algebras may be large even for small sets of small algebras and very few generators, this naive method for checking admissibilit...
متن کاملDistributive Congruence Lattices of Congruence-permutable Algebras
We prove that every distributive algebraic lattice with at most א1 compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The א1 bound is optimal, as we find a distributive algebraic lattice D with א2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost permutable congruences (hence n...
متن کاملFinitely Based Modular Congruence Varieties Are Distributive
R. Dedekind introduced the modular law, a lattice equation true in most of the lattices associated with classical algebraic systems, see [4]. Although this law is one of the most important tools for working with these lattices, it does not fully describe the equational properties of these lattices. This was made clear in [8] where B. Jónsson and the author showed that if any modular congruence ...
متن کاملFinite Basis Theorems for Relatively Congruence-distributive Quasivarieties
Q is any quasivariety. A congruence relation 0 on a member A of Q is a Q-congruence if A/0 G Q. The set CouqA. of all Qcongruences is closed under arbitrary intersection and hence forms a complete lattice Cong A. Q. is relatively congruence-distributive if ConjA is distributive for every A e Q.. Relatively congruence-distributive quasivarieties occur naturally in the theory of abstract data typ...
متن کاملFinitely Related Algebras in Congruence Distributive Varieties Have Near Unanimity Terms
We show that every finite, finitely related algebra in a congruence distributive variety has a near unanimity term operation. As a consequence we solve the near unanimity problem for relational structures: it is decidable whether a given finite set of relations on a finite set admits a compatible near unanimity operation. This consequence also implies that it is decidable whether a given finite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1989
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-133-1-47-57